Endomorphisms of undirected modifications of directed graphs

نویسنده

  • Vera Trnková
چکیده

If z is an automorphism (or an endomorphism) of H, then it is also an automorphism (or an endomorphism) of %H and of %H. Hence the automorphism group Aut H is a subgroup of Aut 9?H and of Aut %H. Is there any other relation between the groups Aut H, Aut CBH and Aut %H? More in detail, which spans of groups, see Fig. 1, where m,, m2 are monomorphisms, can be realized by directed graphs H (in the sense that there exist isomorphisms qO of G,, onto Aut H, q~, of G, onto Aut %JH and q2 of G2 onto Aut %H such that the diagram in Fig. 2-where i,, i2 are the inclusion maps-commutes)? In the present paper, we prove the following.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs of Morphisms of Graphs

This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of endomorphisms is both a monoid and a graph. We extend Shrimpton’...

متن کامل

Project Summary Approximating Network Design Problems on Directed and Undirected Graphs

Network design on directed graphs are problems that require to select a minimum cost directed subgraph of a given edge-weighted directed graph, under some constraints. One of the main goals of this proposal is to understand some of the most fundamental network design problems on directed graphs whose exact approximability status remains unclear for a very long time. Directed graphs appear frequ...

متن کامل

Replacement Paths via Row Minima of Concise Matrices

Matrix M is k-concise if the finite entries of each column of M consist of k or fewer intervals of identical numbers. We give an O(n + m)-time algorithm to compute the row minima of any O(1)-concise n×m matrix. Our algorithm yields the first O(n+m)-time reductions from the replacement-paths problem on an n-node m-edge undirected graph (respectively, directed acyclic graph) to the single-source ...

متن کامل

Undirected Cat-and-Mouse is P-complete

Cat-and-mouse is a two-player game on a finite graph. Chandra and Stockmeyer showed cat-and-mouse is P-complete on directed graphs. We show cat-and-mouse is P-complete on undirected graphs. To our knowledge, no proof of the directed case was ever published. To fill this gap we give a proof for directed graphs and extend it to undirected graphs. The proof is a reduction from a variant of the cir...

متن کامل

New Parameterized Algorithms for APSP in Directed Graphs

All Pairs Shortest Path (APSP) is a classic problem in graph theory. While for general weighted graphs there is no algorithm that computes APSP in O(n3−ε) time (ε > 0), by using fast matrix multiplication algorithms, we can compute APSP in O(n logn) time (ω < 2.373) for undirected unweighted graphs, and in O(n2.5302) time for directed unweighted graphs. In the current state of matters, there is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 108  شماره 

صفحات  -

تاریخ انتشار 1992